Minimizing drop cost for SONET/WDM networks with wavelength requirements

نویسندگان

  • Charles J. Colbourn
  • Peng-Jun Wan
چکیده

SONET/WDM networks using wavelength add–drop multiplexing can be constructed using certain graph decompositions used to form a “grooming,” consisting of unions of certain primitive rings. The existence of such decompositions when every pair of sites employs no more than 8 of the wavelength capacity is determined, with few possible exceptions, when the ring size is a multiple of four. The techniques developed rely heavily on tools from combinatorial design theory. © 2001 John Wiley & Sons, Inc.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimizing Drop Cost for SONET/WDM Networks with 18 Wavelength Requirements

SONET/WDM networks using wavelength add–drop multiplexing can be constructed using certain graph decompositions used to form a “grooming,” consisting of unions of certain primitive rings. The existence of such decompositions when every pair of sites employs no more than 8 of the wavelength capacity is determined, with few possible exceptions, when the ring size is a multiple of four. The techni...

متن کامل

Minimizing Drop Cost for SONET / WDMNetworks with 18 Wavelength

SONET/WDM networks using wavelength add-drop multiplexing can be constructed using certain graph decompositions used to form a `grooming', consisting of unions of certain primitive rings. The existence of such decompositions when every pair of sites employs no more than 1 8 of the wavelength capacity is determined , with few possible exceptions, when the ring size is a multiple of four.

متن کامل

Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven

In order to reduce the number of add-drop multiplexers (ADMs) in SONET/WDM networks using wavelength add-drop multiplexing, certain graph decompositions can be used to form a “grooming” that specifies the assignment of traffic to wavelengths. When traffic among nodes is all-to-all and uniform, the drop cost of such a decomposition is the sum, over all graphs in the decomposition, of the number ...

متن کامل

Dynamic traffic grooming algorithms for reconfigurable SONET over WDM networks - Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE

Most of today's optical networks are built on E:ONET rings [I]. Using WDM technology, multiple rings can be sup ported on a single fiber ring [3]. In this architecture, each wavelength independently carries a SONET ring. Each SONET ring can further support multiple low speed streams (e.g. an OC48 SONET ring can support 4 OC-12 or 16 OC-3 streams at the same time). At each node a WDM Add/Drop Mu...

متن کامل

Practical Traffic Grooming Scheme for Single-Hub SONET/WDM Rings

In SONET/WDM networks, one fiber supports multiple wavelengths and each wavelength supports several low rate tributary streams. ‘Traffic grooming’ then is defined as properly using SONET Add/Drop Multiplexer to electronically multiplex and demultiplex required tributary traffic patterns with minimal resource cost (wavelengths and ADMs). This paper studies traffic grooming problem in single hub ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Networks

دوره 37  شماره 

صفحات  -

تاریخ انتشار 2001